Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
191	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics∗ S¨oren Laue† Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:19 Operations research Spanning tree Complexity classes NP-complete problems Minimum spanning tree Steiner tree problem R-tree Approximation algorithm Facility location Theoretical computer science Computational complexity theory Applied mathematics
192	Subcubic Algorithms for Recursive State Machines Swarat Chaudhuri Pennsylvania State University University Park, PA 16802, USA Add to Reading List Source URL: www.cs.rice.edu Language: English - Date: 2008-03-07 16:10:53 Complexity classes Graph connectivity Reachability Connected component Transitive closure SL FO Configuration graph Connectivity Theoretical computer science Graph theory Mathematics
193	Advanced Procedures for Hard Problems in Abstract Argumentation Johannes Peter Wallner Institute of Information Systems Vienna University of Technology Add to Reading List Source URL: www.inf.kcl.ac.uk Language: English - Date: 2013-06-09 11:47:58 Critical thinking Arguments Logic Argumentation theory NP-complete Boolean satisfiability problem NP-hard Oracle machine Algorithm Theoretical computer science Applied mathematics Complexity classes
194	FA11_apps_adm_acc_new.xlsx Add to Reading List Source URL: grad.ucsd.edu Language: English - Date: 2014-10-31 13:42:31 Science Complexity classes NP Healthcare science
195	Deterministic Amplification of Space-Bounded Probabilistic Algorithms Ziv Bar-Yossef Department of Electrical Engineering and Computer Science U.C. Berkeley Berkeley, CA 94720 Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:25:14 Complexity classes Expander graph Randomized algorithm Extractor Algorithm Random walk SL NP Randomness extractor Theoretical computer science Applied mathematics Mathematics
196	A Theory and Algorithms for Combinatorial Reoptimization? Hadas Shachnai1?? , Gal Tamir1 , and Tami Tamir2 1 2 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-02-29 12:43:33 Operations research Complexity classes NP-complete problems Approximation algorithm Optimization problem Reduction NP Knapsack problem Dynamic programming Theoretical computer science Applied mathematics Computational complexity theory
197	FA14_Women_Apps_Admits_New_Total.xlsx Add to Reading List Source URL: grad.ucsd.edu Language: English - Date: 2014-11-12 14:14:59 Rady School of Management Computer science Healthcare science Complexity classes Jacobs School of Engineering NP
198	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Minimizing the endpoint trace length of rod motions amidst polygonal obstacles is NP-hard Extended Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:37 Applied mathematics Optical devices Network theory NP Shortest path problem Beam splitter Theoretical computer science Computational complexity theory Complexity classes
199	URL: http://www.elsevier.nl/locate/entcs/volume61.html 19 pages Parameterized Complexity: The Main Ideas and Connections to Practical Computing Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:10:30 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Dominating set Kernelization Vertex cover Clique problem NP-complete Theoretical computer science Computational complexity theory Applied mathematics

UPDATE